首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6152篇
  免费   511篇
  国内免费   31篇
化学   4808篇
晶体学   28篇
力学   158篇
综合类   1篇
数学   1020篇
物理学   679篇
  2021年   52篇
  2020年   64篇
  2019年   109篇
  2018年   65篇
  2017年   63篇
  2016年   211篇
  2015年   236篇
  2014年   231篇
  2013年   384篇
  2012年   301篇
  2011年   318篇
  2010年   282篇
  2009年   286篇
  2008年   324篇
  2007年   274篇
  2006年   259篇
  2005年   233篇
  2004年   270篇
  2003年   215篇
  2002年   277篇
  2001年   151篇
  2000年   142篇
  1999年   71篇
  1998年   65篇
  1997年   75篇
  1996年   76篇
  1995年   56篇
  1994年   70篇
  1993年   69篇
  1992年   63篇
  1991年   39篇
  1990年   45篇
  1989年   45篇
  1988年   40篇
  1987年   40篇
  1986年   37篇
  1985年   45篇
  1984年   64篇
  1983年   52篇
  1982年   70篇
  1981年   70篇
  1980年   73篇
  1979年   82篇
  1978年   78篇
  1977年   83篇
  1976年   76篇
  1975年   74篇
  1974年   75篇
  1973年   53篇
  1972年   18篇
排序方式: 共有6694条查询结果,搜索用时 15 毫秒
21.
22.
Conclusion  The debate between Jean-Pierre Changeux and Alain Connes is one of the most, interesting to take place in recent years. It re-frames in a very up-to-date context a whole series of traditional and difficult questions from the standpoint of the knowledge and experience of two of the leading protagonists of contemporary science. To the choice presented by the neurobiologist between a Platonist ontology and a neurocognitive psychology of mathematical activity, the mathematician replies with a conception that is objective (neither ontological nor psychological) of the thoroughly consistent universe of mathematical idealities. It is indeed in this three-sided arena that the major difficulties play themselves out. One of the great virtues of the book is to cast a spotlight on this confrontation.  相似文献   
23.
We bound the number of plane segments in a crystalline minimal surface S in terms of its Euler characteristic, the number of line segments in its boundary, and a factor determined by the Wulff shapeW of its surface energy function. A major technique in the proofs is to quantize the Gauss map ofS based on the Gauss map ofW. One thereby bounds the number of positive-curvature corners and the interior complexity ofS. The support of the National Science Foundation and the Air Force Office of Scientific Research and the hospitality of Stanford University, where this paper was extensively rewritten, are gratefully acknowledged.  相似文献   
24.
Various types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m × n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99-104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained.  相似文献   
25.
Summary We consider a one-dimensional linear wave equation with a small mean zero dissipative field and with the boundary condition imposed by the so-called Goursat problem. In order to observe the effect of the randomness on the solution we perform a space-time rescaling and we rewrite the problem in a diffusion approximation form for two parameter processes. We prove that the solution converges in distribution toward the solution of a two-parameter stochastic differential equation which we identify. The diffusion approximation results for oneparameter processes are well known and well understood. In fact, the solution of the one-parameter analog of the problem we consider here is immediate. Unfortunately, the situation is much more complicated for two-parameter processes and we believe that our result is the first one of its kind.Partially supported by ONR N00014-91-J-1010  相似文献   
26.
For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these results to multigraphs. Instead of considering several color interchanges along alternating chains (Vizing, Gupta), using counting arguments (Ehrenfeucht, Faber, Kierstead), or improving nonvalid colorings with Fournier's Lemma, the method of proof consists of using one single easy transformation, called “sequential recoloring”, to augment a partial k-coloring of the edges.  相似文献   
27.
28.
In the introduction of the Arithmetica Diophantus says that in order to solve arithmetical problems one has to “follow the way he (Diophantus) will show.” The present paper has a threefold objective. Firstly, the meaning of this sentence is discussed, the conclusion being that Diophantus had elaborated a program for handling various arithmetical problems. Secondly, it is claimed that what is analyzed in the introduction is definitions of several terms, the exhibition of their symbolism, the way one may operate with them, but, most significantly, the main stages of the program itself. And thirdly, it is argued that Diophantus' intention in the Arithmetica is to show the way the stages of his program should be practically applied in various arithmetical problems.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号